Theory of computation - PDFSEARCH.IO - Document Search Engine

Theory of computation
Results: 2087

#	Item
121	Automatically Computing Program Path Complexity Lucas Bang, Abdulbaki Aydin, and Tevfik Bultan I. I NTRODUCTION Recent automated software testing techniques focus on achieving path coverage. We present a program complexi Add to Reading List Source URL: gswc.cs.ucsb.edu Language: English - Date: 2016-03-01 02:43:37 Computational complexity theory Software metrics Software engineering Theory of computation Complexity classes Cyclomatic complexity Software testing Structural complexity theory Control flow graph Complexity Code coverage PL
122	Algorithmica: 67–80 DOI: s00453Algorithmica © Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2002-07-02 08:00:25 Computational complexity theory Theory of computation Algorithms Theoretical computer science Analysis of algorithms Probabilistic complexity theory Streaming algorithm Property testing Randomized algorithm Sequence NC Sampling
123	A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom) Add to Reading List Source URL: www.math.ru.nl Language: English - Date: 2016-04-12 05:51:20 Computational complexity theory Theory of computation Mathematics Operations research Complexity classes Mathematical optimization Structural complexity theory Theoretical computer science NP Linear programming Algorithm Reduction
124	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
125	On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira Add to Reading List Source URL: www.dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:56 Theory of computation Complexity classes Mathematics Theoretical computer science Valuation Submodular set function NC NP Reduction P/poly
126	Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2007-08-27 22:45:23 Computational complexity theory Theory of computation Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Minimum spanning tree Point location
127	Computing Fundamentals Advanced functions & Recursion Salvatore Filippone–2015 Add to Reading List Source URL: people.uniroma2.it Language: English - Date: 2015-05-28 11:41:55 Software engineering Computer programming Recursion Computability theory Theory of computation Subroutines Theoretical computer science Infinite loop This Anonymous function Stack Mutual recursion
128	MCS 441 – Theory of Computation I Spring 2016 Problem Set 1 Lev Reyzin Due: at the beginning of class Instructions: Atop your problem set, please write your name and whether you are an undergraduate or graduate Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-02-03 00:10:01 Finite automata Regular language Nondeterministic finite automaton
129	Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Add to Reading List Source URL: stefan.buettcher.org Language: English - Date: 2004-09-19 21:38:52 Computational complexity theory Theory of computation Mathematics NP-complete problems Set cover problem NP Dominating set Approximation algorithm Metric k-center Optimization problem Reduction P versus NP problem
130	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Complexity classes Theory of computation NP P Reduction Time complexity

UPDATE